搜索资源列表
Guess_Prime
- 判断一个数是否是高斯素数，首先找出高斯整数，然后再进行挑选-Determine whether a number is a Gaussian prime, first find out the Gaussian integers, then pick and choose
sushu
- 本代码主要实现对一个数是否是素数进行测试。-This code mainly realize whether a number is prime for testing.
RSAjiami
- RSA算法中大数幂乘，大素数判断，求逆元，大整数乘法-RSA algorithm in the large number of power multiplier, large prime judgments, seeking inverse yuan, large integer multiplication
procprureslearning
- 判断一个数是否是质数的小程序,仅供参考与学习-To judge whether a number is prime Numbers of small procedures, for reference only and learning
prob3
- Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to
哥德巴赫猜想
- 如果任意一个大于6的偶数都可以写成两个素数之和(If any even number greater than 6 can be written as the sum of two prime numbers)
com
- 简单版飞机大战，分为英雄机，敌机，敌机分两种，大飞机和普通飞机(Find all the prime numbers between 1 and any number)
zhaomayabng
- 计算素数的个数并挑选出矩阵中满足序号为素数的数(Calculate the number of prime numbers and pick out the number in the matrix that satisfies the ordinal number)
easy code
- 可以用来判断一个数是否是素数，并且输出0——101之间的所有素数(Can be used to judge whether a number is a prime and output all the prime numbers between 0 - 101)
python
- 寻找一个数有没有素数因子,首先是判断是不是素数，再判断有没有素数因子。还有一些python的简单例子。(To see if a number have a prime factor or some prime factors.)